Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Delaunay triangulation")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 539

  • Page / 22
Export

Selection :

  • and

Keyframe-based video summarization using Delaunay clusteringMUNDUR, Padmavathi; YONG RAO; YESHA, Yelena et al.International journal on digital libraries (Print). 2006, Vol 6, Num 2, pp 219-232, issn 1432-5012, 14 p.Article

On Delaunay triangulation automata with memoryALONSO-SANZ, Ramón; ADAMATZKY, Andrew.Nano communication networks (Print). 2013, Vol 4, Num 4, pp 216-228, issn 1878-7789, 13 p.Article

A geometric solution to the largest-free-sphere problem in zeolite frameworksFOSTER, M. D; RIVIN, I; TREACY, M. M. J et al.Microporous and mesoporous materials. 2006, Vol 90, Num 1-3, pp 32-38, issn 1387-1811, 7 p.Article

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and ExtendedBUCHIN, Kevin; LÖFFLER, Maarten; MORIN, Pat et al.Algorithmica. 2011, Vol 61, Num 3, pp 674-693, issn 0178-4617, 20 p.Article

Flipping to robustly delete a vertex in a delaunay tetrahedralizationLEDOUX, Hugo; GOLD, Christopher M; BACIU, George et al.Lecture notes in computer science. 2005, pp 737-747, issn 0302-9743, isbn 3-540-25860-4, 4Vol, 11 p.Conference Paper

Local Hull-Based Surface Construction of Volumetric Data From SilhouettesSHIN, Dongjoe; TJAHJADI, Tardi.IEEE transactions on image processing. 2008, Vol 17, Num 8, pp 1251-1260, issn 1057-7149, 10 p.Article

Finding a triangular mesh with a constant number of different edge lengths : New horizons in computingTANIGAWA, Shin-Ichi; KATOH, Naoki.IEICE transactions on information and systems. 2006, Vol 89, Num 8, pp 2364-2371, issn 0916-8532, 8 p.Article

A whirlwind tour of computational geometryGRAHAM, R; YAO, F.The American mathematical monthly. 1990, Vol 97, Num 8, pp 687-701, issn 0002-9890, 15 p.Article

Construction of Voronoi diagrams in the plane by using mapsELBAZ, M; SPEHNER, J.-C.Theoretical computer science. 1990, Vol 77, Num 3, pp 331-343, issn 0304-3975, 13 p.Article

The Problem of Fingerprint Identification: A Reference Database Indexing Method Based on Delaunay TriangulationKHACHAI, M. Yu; LESHKO, A. S; DREMIN, A. V et al.Pattern recognition and image analysis. 2014, Vol 24, Num 2, pp 297-303, issn 1054-6618, 7 p.Article

Smooth surface reconstruction from scattered data pointsAGISHTEIN, M. E; MIGDAL, A. A.Computers & graphics. 1991, Vol 15, Num 1, pp 29-39, issn 0097-8493, 11 p.Article

Nanoscale adaptive meshing for rapid STM imagingBEDWANI, Stéphane; GUIBAULT, Francois; ROCHEFORT, Alain et al.Journal of computational physics (Print). 2008, Vol 227, Num 14, pp 6720-6726, issn 0021-9991, 7 p.Article

Generalized Delaunay triangulations of non-convex domainsBOÊRGERS, C.Computers & mathematics with applications (1987). 1990, Vol 20, Num 7, pp 45-49, issn 0898-1221, 5 p.Article

Diagramme de Laguerre = The Laguerre diagramBOROUCHAKI, Houman; FLANDRIN, Nicolas; BENNIS, Chakib et al.Comptes rendus. Mécanique. 2005, Vol 333, Num 10, pp 762-767, issn 1631-0721, 6 p.Article

Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front techniqueLI, S. S; SHI, John Z.Communications in numerical methods in engineering. 2006, Vol 22, Num 5, pp 467-474, issn 1069-8299, 8 p.Article

Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulationDESHENG WANG; HASSAN, Oubay; MORGAN, Kenneth et al.International journal for numerical methods in engineering. 2006, Vol 65, Num 5, pp 734-751, issn 0029-5981, 18 p.Article

Géométrie algorithmique = Computational geometryBERSTEL, J; POCCHIOLA, M.Le Courrier du C.N.R.S. 1993, Num 80, pp 58-59, issn 0153-985XArticle

Computational geometry and the design of aperture-synthesis telescopes. I. A measure of the quality of the uv-plane coverageWEBSTER, A. S.Astronomy and astrophysics (Berlin. Print). 2004, Vol 427, Num 1, pp 377-386, issn 0004-6361, 10 p.Article

Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedureJIANJUN CHEN; DAWEI ZHAO; ZHENGGE HUANG et al.Computers & structures. 2011, Vol 89, Num 5-6, pp 455-466, issn 0045-7949, 12 p.Article

Modified DAG location for Delaunay triangulationKOLINGEROVA, Ivana.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 125-134Conference Paper

Evaluation of a Delaunay-based method for surface approximationPER-OLOF FJÄLLSTRÖM.Computer-aided design. 1993, Vol 25, Num 11, pp 711-719, issn 0010-4485Article

Delaunay-admissibilité des triangulations de surfaces = Delaunay-conformity of surface triangulationsPEBAY, P. P; FREY, P. J.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 3, pp 313-318, issn 0764-4442Article

Illustrating the streaming construction of 2D delaunay triangulationsISENBURG, Martin; YUANXIN LIU; SHEWCHUK, Jonathan et al.SCG : symposium on computational geometry. 2006, pp 481-482, isbn 1-59593-340-9, 1Vol, 2 p.Conference Paper

An optimal algorithm for realizing a Delaunay triangulationLAMBERT, T.Information processing letters. 1997, Vol 62, Num 5, pp 245-250, issn 0020-0190Article

Delaunay triangulation of surfacesKUCWAJ, J.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 487-488, issn 0044-2267, SUP3Conference Paper

  • Page / 22